Fault Hamiltonicity of the Shuffle - Cubes ∗
نویسندگان
چکیده
Hypercubes are famous interconnection networks. The shuffle cubes are proposed as its variation with lower diameter. In this paper, we concentrate on the fault tolerant hamiltonicity and hamiltonian connectivity of the shuffle cube. We say that a graph G is f-hamiltonian if there is a hamiltonian cycle in G − F and is f-hamiltonian connected if there is a hamiltonian path between any two vertices of G−F for any F ⊆ V (G)∪E(G) with |F | ≤ f . We show that the n-dimensional shuffle cube is (n − 2)-hamiltonian and (n − 3)hamiltonian connected.
منابع مشابه
Wirelength of 1-fault hamiltonian graphs into wheels and fans
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes, hierarchical cubic networks, alternating gr...
متن کاملEdge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
The locally twisted cube is a variation of hypercube, which possesses some properties superior to the hypercube. In this paper, we investigate the edge-faulttolerant hamiltonicity of an n-dimensional locally twisted cube, denoted by LTQn. We show that for any LTQn (n ≥ 3) with at most 2n− 5 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free H...
متن کاملFault-Tolerant Hamiltonicity of Twisted Cubes
The twisted cube TQn, is derived by changing some connection of hypercube Qn according to specific rules. Recently, many topological properties of this variation cube are studied. In this paper, we consider a faulty twisted n-cube with both edge and/or node faults. Let F be a subset of V(TQn) 5 E(TQn), we prove that TQn −F remains hamiltonian if |F| [ n−2. Moreover, we prove that there exists a...
متن کاملThe property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant hamiltonicity of an interconnection network. In this paper, we first study the property of edge-disjoint Hamiltonian cycles in tr...
متن کاملPanconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Jwo et al. [Networks 23 (1993) 315–326] introduced the alternating group graph as an interconnection network topology for computing systems. They showed that the proposed structure has many advantages over n-cubes and star graphs. For example, all alternating group graphs are hamiltonian-connected (i.e., every pair of vertices in the graph are connected by a hamiltonian path) and pancyclic (i.e...
متن کامل